Physical publicly verifiable randomness from pulsars
نویسندگان
چکیده
We demonstrate how radio pulsars can be used as random number generators. Specifically, we focus on publicly verifiable randomness (PVR), in which the same sequence of trusted and numbers is obtained by multiple parties. PVR a critical building block for many processes algorithms (including cryptography, scientific trials, electoral audits international treaties). However, current approaches (based theory) may soon become vulnerable to quantum computers, motivating growing demand based natural physical phenomena. In this context, explore potential source. first show that bit sequences extracted from measured flux densities bright millisecond pulsar pass standardised tests randomness. then quantify three illustrative methods bit-extraction density sequences, using simultaneous observations second carried out with Parkes telescope Australia Five-hundred-metre Aperture Spherical Telescope (FAST) China, supported numerical simulations. indeed at both observatories, but ubiquitous presence radiometer noise needs accounted when determining expected error rate between two independent sequences. discuss our results context an imaginary use-case mutually distrusting parties wish obtain sequence, exploring mitigate against malicious participant.
منابع مشابه
Publicly Verifiable Ciphertexts
In many applications, where encrypted traffic flows from an open (public) domain to a protected (private) domain, there exists a gateway that bridges the two domains and faithfully forwards the incoming traffic to the receiver. We observe that indistinguishability against (adaptive) chosen-ciphertext attacks (IND-CCA), which is a mandatory goal in face of active attacks in a public domain, can ...
متن کاملHybrid Publicly Verifiable Computation
Publicly Verifiable Outsourced Computation (PVC) allows weak devices to delegate computations to more powerful servers, and to verify the correctness of results. Delegation and verification rely only on public parameters, and thus PVC lends itself to large multi-user systems where entities need not be registered. In such settings, individual user requirements may be diverse and cannot be realis...
متن کاملPublicly Verifiable Software Watermarking
Software Watermarking is the process of transforming a program into a functionally equivalent “marked” program in such a way that it is computationally hard to remove the mark without destroying functionality. Barak, Goldreich, Impagliazzo, Rudich, Sahai, Vadhan and Yang (CRYPTO 2001) defined software watermarking and showed that the existence of indistinguishability obfuscation implies that so...
متن کاملPublicly Verifiable Blind Quantum Computation
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum comput...
متن کاملRevocation in Publicly Verifiable Outsourced Computation
The combination of software-as-a-service and the increasing use of mobile devices gives rise to a considerable difference in computational power between servers and clients. Thus, there is a desire for clients to outsource the evaluation of complex functions to an external server. Servers providing such a service may be rewarded per computation, and as such have an incentive to cheat by returni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Astronomy and Computing
سال: 2022
ISSN: ['2213-1345', '2213-1337']
DOI: https://doi.org/10.1016/j.ascom.2022.100549